Rough Sets, Coverings and Incomplete Information

نویسندگان

  • Inés Couso
  • Didier Dubois
چکیده

Rough sets are often induced by descriptions of objects based on the precise observations of an insufficient number of attributes. In this paper, we study generalizations of rough sets to incomplete information systems, involving imprecise observations of attributes. The precise role of covering-based approximations of sets that extend the standard rough sets in the presence of incomplete information about attribute values is described. In this setting, a covering encodes a set of possible partitions of the set of objects. A natural semantics of two possible generalisations of rough sets to the case of a covering (or a non transitive tolerance relation) is laid bare. It is shown that uncertainty due to granularity of the description of sets by attributes and uncertainty due to incomplete information are superposed, whereby upper and lower approximations themselves (in Pawlak’s sense) become ill-known, each being bracketed by two nested sets. The notion of measure of accuracy is extended to the incomplete information setting, and the generalization of this construct to fuzzy attribute mappings is outlined.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information Entropy and Granulation Co-Entropy of Partitions and Coverings: A Summary

Some approaches to the covering information entropy and some definitions of orderings and quasi–orderings of coverings will be described, generalizing the case of the partition entropy and ordering. The aim is to extend to covering the general result of anti–tonicity (strictly decreasing monotonicity) of partition entropy. In particular an entropy in the case of incomplete information systems i...

متن کامل

Rough Set Theory with Applications to Data Mining

This paper is an introduction to rough set theory with an emphasis on applications to data mining. First, consistent data are discussed, including blocks of attribute-value pairs, reducts of information tables, indiscernibility relation, decision tables, and global and local coverings. Rule induction algorithms LEM1 and LEM2 are presented. Then the rough set approach to inconsistent data is int...

متن کامل

Covering rough sets based on neighborhoods: An approach without using neighborhoods

Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have b...

متن کامل

Deriving Consensus for Hierarchical Incomplete Ordered Partitions and Coverings

A method for determining consensus of hierarchical incomplete ordered partitions and coverings of sets is presented in this chapter. Incomplete ordered partitions and coverings are often used in expert information analysis. These structures should be useful when an expert has to classify elements of a set into given classes, but referring to several elements he does not know to which classes th...

متن کامل

Generalized fuzzy rough sets based on fuzzy coverings

This paper further studies the fuzzy rough sets based on fuzzy coverings. We first present the notions of the lower and upper approximation operators based on fuzzy coverings and derive their basic properties. To facilitate the computation of fuzzy coverings for fuzzy covering rough sets, the concepts of fuzzy subcoverings, the reducible and intersectional elements, the union and intersection o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 108  شماره 

صفحات  -

تاریخ انتشار 2011